Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square
نویسنده
چکیده
We prove new optimal bounds for the error of numerical integration in bivariate Besov spaces with dominating mixed order r. The results essentially improve on the so far best known upper bound achieved by using cubature formulas taking points from a sparse grid. Motivated by Hinrichs’ observation that Hammersley type point sets provide optimal discrepancy estimates in Besov spaces with mixed smoothness on the unit square, we directly study quasi-Monte Carlo integration on such point sets. As the main tool we prove the representation of a bivariate periodic function in a piecewise linear tensor Faber basis. This allows for optimal worst case estimates of the QMC integration error with respect to Besov spaces with dominating mixed smoothness up to order r < 2. The results in this paper are a first step towards sharp results for spaces with arbitrarily large mixed order on the d-dimensional unit cube. In fact, in contrast to Fibonacci lattice rules, which are also practicable in this context, the QMC methods used in this paper have a proper counterpart in d dimensions.
منابع مشابه
Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube
In a recent article by two of the present authors it turned out that Frolov’s cubature formulae are optimal and universal for various settings (Besov-Triebel-Lizorkin spaces) of functions with dominating mixed smoothness. Those cubature formulae go well together with functions supported inside the unit cube [0, 1]. The question for the optimal numerical integration of multivariate functions wit...
متن کاملThe Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative
We prove upper bounds on the order of convergence of Frolov’s cubature formula for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study worst-case integration errors for Besov Bp,θ and Triebel-Lizorkin spaces F s p,θ and our results treat the whole range of admissible parameters (s ≥ 1/p). In parti...
متن کاملSampling and Cubature on Sparse Grids Based on a B-spline Quasi-Interpolation
Let Xn = {x j }j=1 be a set of n points in the d-cube Id := [0, 1]d , and n = {φ j }j=1 a family of n functions on Id . We consider the approximate recovery of functions f on Id from the sampled values f (x1), . . . , f (xn), by the linear sampling algorithm Ln(Xn, n, f ) := ∑nj=1 f (x j )φ j . The error of sampling recovery is measured in the norm of the space Lq(I)-norm or the energy quasi-no...
متن کاملLattice based integration algorithms: Kronecker sequences and rank-1 lattices
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study worst-case integration errors for Besov spaces of dominating mixed smoothness B̊p,θ, which also comprise the concept of Sobolev spaces of dominating mixed smoothness...
متن کاملInterpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions
In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Complexity
دوره 30 شماره
صفحات -
تاریخ انتشار 2014